Ant Colony Algorithm for the Single Loop Routing Problem

author

K. Eshgee and M. Kazemi

Abstract:

In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system is developed for ALRP by using the properties of the graph model. Computational results show the efficiency of the proposed algorithm in comparison with other techniques for solving SLRP.

Upgrade to premium to download articles

Already have an account?login

similar resources

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

PBANT-Optimized ANT Colony Routing Algorithm For ManetsPBANT-Optimized ANT Colony Routing Algorithm For Manets

The biggest challenge in MANETs is to find a path between the communication end points, which is aggravated through the node mobility in a limited resource scenario.AntColony-Based Routing Algorithm (ARA) is an on-demand routing algorithm for mobile, multi-hop ad-hoc networks that uses swarm intelligence paradigm and ant colony based meta heuristic. These approaches try to map the solution capa...

full text

Multicast computer network routing using genetic algorithm and ant colony

Due to the growth and development of computer networks, the importance of the routing topic has been increased. The importance of the use of multicast networks is not negligible nowadays. Many of multimedia programs need to use a communication link to send a packet from a sender to several receivers. To support such programs, there is a need to make an optimal multicast tree to indicate the opt...

full text

an effective ant colony algorithm for the traveling salesman problem

the traveling salesman problem (tsp) is a well-known combinatorial optimization problem and holds a central place in logistics management. the tsp has received much attention because of its practical applications in industrial problems. many exact, heuristic and metaheuristic approaches have been proposed to solve tsp in recent years. in this paper, a modified ant colony optimization (maco) is ...

full text

Min-max Vehicle Routing Problem Based on Ant Colony Algorithm

To minimize the length of travelling distance of the longest sub-route in vehicle routing problem, the max-min ant system with parameter adaptation is adopted, which can be applied to different datasets in practice. Routes are constructed by sequential and parallel methods for the customers with clustering and random distribution respectively. Since the behavior of ant colony algorithm depends ...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}

Journal title

روش های عددی در مهندسی (استقلال)

volume 23 issue 1

pages 71- 81

publication date 2004-07

unfollow

{@ msg @}

By following a journal you will be notified via email when a new issue of this journal is published.

Keywords

Hosted on Doprax cloud platform doprax.com